منابع مشابه
Dumont's Statistic on Words
We define Dumont’s statistic on the symmetric group Sn to be the function dmc: Sn → N which maps a permutation σ to the number of distinct nonzero letters in code(σ). Dumont showed that this statistic is Eulerian. Naturally extending Dumont’s statistic to the rearrangement classes of arbitrary words, we create a generalized statistic which is again Eulerian. As a consequence, we show that for e...
متن کاملSegmenting A Sentence Into Morpiiemes Using Statistic Information Between Words
This paper is on dividing non-separated language sentences (whose words are not separated from each other with a space or other separaters) into morphemes using statistical information, not grammatical information which is often used in NLP. In this paper we describe our method and experimental result on Japanese and Chinese sentences. As will be seen in the body of this paper, the result shows...
متن کاملA Statistic Study of Three-character Unknown Words in Chinese
Increase in three-character words attracts more and more attention from researchers. In the present paper, the ratio of three-character words unrecorded in the Grammatical Knowledge-base of Contemporary Chinese is obtained by an analysis of the tagged corpus of People’s Daily of 1998. (henceforth, three-character unknown words). The results show that the number of the three-character unkown wor...
متن کاملSegmenting A Sentence Into Morphemes Using Statistic Information Between Words
This paper is on dividing non-separated language sentences (whose words are not separated from each other with a space or other separaters) into morphemes using statistical information, not grammatical information which is often used in NLP. In this paper we describe our method and experimental result on Japanese and Chinese se~,tences. As will be seen in the body of this paper, the result show...
متن کاملA Statistic on Involutions
We define a statistic, called weight, on involutions and consider two applications in which this statistic arises. Let I (n)denote the set of all involutions on [n](= {1, 2, . . . , n}) and let F(2n)denote the set of all fixed point free involutions on [2n]. For an involution δ, let |δ| denote the number of 2-cycles in δ. Let [n]q = 1+q+· · ·+qn−1 and let (k)q denote the q-binomial coefficient....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2001
ISSN: 1077-8926
DOI: 10.37236/1555